On Ideal Lattices and Gröbner Bases
نویسندگان
چکیده
In this paper, we draw a connection between ideal lattices and Gröbner bases in the multivariate polynomial rings over integers. We study extension of ideal lattices in Z[x]/〈f〉 (Lyubashevsky & Micciancio, 2006) to ideal lattices in Z[x1, . . . , xn]/a, the multivariate case, where f is a polynomial in Z[X] and a is an ideal in Z[x1, . . . , xn]. Ideal lattices in univariate case are interpreted as generalizations of cyclic lattices. We introduce a notion of multivariate cyclic lattices and we show that multivariate ideal lattices are indeed a generalization of them. We show that the fact that existence of ideal lattice in univariate case if and only if f is monic translates to short reduced Gröbner basis (Francis & Dukkipati, 2014) of a is monic in multivariate case. We, thereby, give a necessary and sufficient condition for residue class polynomial rings over Z to have ideal lattices. We also characterize ideals in Z[x1, . . . , xn] that give rise to full rank lattices.
منابع مشابه
On Ideal Lattices, Gr\"obner Bases and Generalized Hash Functions
In this paper, we draw connections between ideal lattices and multivariate polynomial rings over integers using Gröbner bases. Univariate ideal lattices are ideals in the residue class ring, Z[x]/〈f〉 (here f is a monic polynomial) and cryptographic primitives have been built based on these objects. Ideal lattices in the univariate case are generalizations of cyclic lattices. We introduce the no...
متن کاملNote on (De)homogenized Gröbner Bases
By employing the (de)homogenization technique in a relatively extensive setting, this note studies in detail the relation between nonhomogeneous Gröbner bases and homogeneous Gröbner bases. As a consequence, a general principle of computing Gröbner bases (for an ideal and its homogenization ideal) by passing to homogenized generators is clarified systematically. The obtained results improve and...
متن کاملOn Computing the Elimination Ideal Using Resultants with Applications to Gröbner Bases
Resultants and Gröbner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the bivariate case, in which the elimination ideal is principal. We study — by means of elementary tools — the difference between the multiplicity of the factors of ...
متن کاملGraver Bases and Universal Gröbner Bases for Linear Codes
Linear codes over any finite field can be associated to binomial ideals. Focussing on two specific instances, called the code ideal and the generalized code ideal, we present how these binomial ideals can be computed from toric ideals by substituting some variables. Drawing on this result we further show how their Graver bases as well as their universal Gröbner bases can be computed.
متن کاملGröbner bases of ideals invariant under endomorphisms
We introduce the notion of Gröbner S-basis of an ideal of the free associative algebra K〈X〉 over a field K invariant under the action of a semigroup S of endomorphisms of the algebra. We calculate the Gröbner S-bases of the ideal corresponding to the universal enveloping algebra of the free nilpotent of class 2 Lie algebra and of the T-ideal generated by the polynomial identity [x, y, z] = 0, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1409.7788 شماره
صفحات -
تاریخ انتشار 2014